Bivariate segment approximation and splines
نویسندگان
چکیده
منابع مشابه
Bivariate segment approximation and splines
The problem to determine partitions of a given reet angle which are optimal for segment approximation (e.g. by bivariate pieeewise polynomials) is investigated. We give eriteria for optimal partitions and develop algorithms for eomputing optimal partitions of eertain types. It is shown that there is a surprising relationship between various types of optimal partitions. In this way, we obtain go...
متن کاملOn the approximation power of bivariate splines
We show how to construct stable quasi-interpolation schemes in the bivariate spline spaces S r d (4) with d 3r+2 which achieve optimal approximation order. In addition to treating the usual max norm, we also give results in the L p norms, and show that the methods also approximate derivatives to optimal order. We pay special attention to the approximation constants, and show that they depend on...
متن کاملLocal RBF Approximation for Scattered Data Fitting with Bivariate Splines
In this paper we continue our earlier research [4] aimed at developing efficient methods of local approximation suitable for the first stage of a spline based two-stage scattered data fitting algorithm. As an improvement to the pure polynomial local approximation method used in [5], a hybrid polynomial/radial basis scheme was considered in [4], where the local knot locations for the RBF terms w...
متن کاملScattered data interpolation by bivariate splines with higher approximation order
Given a set of scattered data, we usually use a minimal energy method to find Lagrange interpolation based on bivariate spline spaces over a triangulation of the scattered data locations. It is known that the approximation order of the minimal energy spline interpolation is only 2 in terms of the size of triangulation. To improve this order of approximation, we propose several new schemes in th...
متن کاملLocal hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to improve the scattered data fitting algorithm of [7]. Similar to that algorithm, the new method has linear computational complexity and is therefore suitable for large real world data. Numerical examples suggest that it can produce high quality artifact–free approximations that are more ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 1996
ISSN: 1019-7168,1572-9044
DOI: 10.1007/bf02127694